An Approach to the Automatic Recognition of Boolean Decomposition Loops for Swept Volume Decomposition

Hexahedral meshing needs performing volume decomposition that decomposes a complex shape into simple hex meshable sub-domains, which is a very time-consuming and experience needed work. It is necessary to research and develop intelligent swept volume decomposition approaches. The fundamental work of the volume decomposition approaches based on reconstruction of swept features is to recognize the decomposition loops from the complex edge traces. In this paper, an intelligent approach to the automatic recognition of Boolean decomposition loops is presented. This approach first constructs feature vertex adjacent graphs of the part model to be decomposed, and then implements searching for the nodes of decomposition loops. In the searching processes, the initial node selection, the node growth, the searching evaluation, and feedback operations are employed. This work lays the foundation for the subsequent swept volume decomposition. © 2016 The Authors. Published by Elsevier Ltd. Peer-review under responsibility of the organizing committee of IMR 25.